package com.zhugang.week10;

/**
 * @program algorithms
 * @description: uniquePaths
 * @author: chanzhugang
 * @create: 2022/08/29 22:57
 */
public class UniquePaths {

    /**
     * 62 不同路径
     * 计数问题
     *
     * @param m
     * @param n
     * @return
     */
    public int uniquePaths(int m, int n) {
        // 到达i、j位置的路径条数
        // dp[i][j] = dp[i][j - 1] + dp[i - 1][j]
        int[][] dp = new int[m][n];
        // 行、列 第一个设置为1
        for (int i = 0; i < m; i++) {
            dp[i][0] = 1;
        }
        for (int j = 0; j < n; j++) {
            dp[0][j] = 1;
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = dp[i][j - 1] + dp[i - 1][j];
            }
        }
        return dp[m - 1][n - 1];
    }
}